On "The Matching Polynomial of a Polygraph"
نویسندگان
چکیده
In this note we give an explanation for two phenomena mentioned in the concluding remarks of " The matching polynomial of a polygraph " by Babic et al. The following results are obtained: (1) Although three matrices for given polygraphs defined in the above article in general have different orders, they determine the same recurrence relations for the matching polynomial of these polygraphs. (2) Under certain symmetry conditions, the order of the recurrence relations can be reduced by almost a half.
منابع مشابه
Relationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH
Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...
متن کاملPMU-Based Matching Pursuit Method for Black-Box Modeling of Synchronous Generator
This paper presents the application of the matching pursuit method to model synchronous generator. This method is useful for online analysis. In the proposed method, the field voltage is considered as input signal, while the terminal voltage and active power of the generator are output signals. Usually, the difference equation with a second degree polynomial structure is used to estimate the co...
متن کاملOn the $s^{th}$ derivative of a polynomial
For every $1leq s< n$, the $s^{th}$ derivative of a polynomial $P(z)$ of degree $n$ is a polynomial $P^{(s)}(z)$ whose degree is $(n-s)$. This paper presents a result which gives generalizations of some inequalities regarding the $s^{th}$ derivative of a polynomial having zeros outside a circle. Besides, our result gives interesting refinements of some well-known results.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 46 شماره
صفحات -
تاریخ انتشار 1993